Ore Subresultants in Solutions
نویسنده
چکیده
The subresultants play a fundamental role in elimination theory and computer algebra. Recently they have been extended to Ore polynomials. They are de ̄ned by an expression in the coe±cients of Ore polynomials. In this paper, we provide another expression for them. This expression is written in terms of the \solutions" of Ore polynomials (in \generic" case). It is a generalization of our previous paper where we gave the expression for the principal (formal leading) coe±cients of subresultants. In this paper, we give the expressions for all the other coe±cients.
منابع مشابه
An elementary approach to subresultants theory
In this paper we give an elementary approach to univariate polynomial subresultants theory. Most of the known results of subresultants are recovered, some with more precision, without using Euclidean divisions or existence of roots for univariate polynomials. The main contributions of this paper are not new results on subresultants, but rather extensions of the main results over integral rings ...
متن کاملDifferential Resultants and Subresultants
Consider two differential operators L1 = ∑ aid i and L2 = ∑ bjd j with coefficients in a differential field, say C(t) with d = ∂ ∂t for example. If the ai and bj are constants, the condition for the existence of a solution y of L1(y) = L2(y) = 0 is that the resultant in X of the polynomials (in C[X]) ∑ aiX i and ∑ bjX j is zero. A natural question is: how one could extend this for the case of n...
متن کاملRésultants de polynômes de Ore et Cryptosystèmes de McEliece sur des Codes Rang faiblement structurés. (Resultants of Ore polynomials and McEliece Cryptosystems based on weakly structured Rank Codes)
Weakly Structured Error Correcting Codes in Rank Metric and their Application to Cryptography The most commonly used encryption techniques in cryptography are based on problems in number theory. Despite their efficiency, they are vulnerable to post-quantum cryptographic attack. Therefore it is relevant to study other types of cryptosystems. In this work we study errorcorrector codes based crypt...
متن کاملHyperexponential Solutions of Finite-rank Ideals in Orthogonal Ore Algebras (the General Case)
An orthogonal Ore algebra is an abstraction of common properties of linear partial differential, shift and q-shift operators. Using orthogonal Ore algebras, we present an algorithm for finding hyperexponential solutions of a system of linear differential, shift and q-shift operators, or any mixture thereof, whose solution space is finite-dimensional. The algorithm is applicable to factoring mod...
متن کاملSubresultants in Recursive Polynomial Remainder Sequence
We introduce concepts of “recursive polynomial remainder sequence (PRS)” and “recursive subresultant,” and investigate their properties. In calculating PRS, if there exists the GCD (greatest common divisor) of initial polynomials, we calculate “recursively” with new PRS for the GCD and its derivative, until a constant is derived. We call such a PRS a recursive PRS. We define recursive subresult...
متن کامل